Performance Analysis of Discrete Time Bulk Queues with Restricted Departure Sizes in Power Efficient Scheduling

We consider a class of discrete time bulk-service queues with buffer of infinite size where requests can be serviced in batches of given fixed sizes only. We provide techniques to obtain the steady state distribution of such queues for a general arrival process. Such queues arise out of the problem of power efficient packet scheduling in a communication system with discrete rates. Analysis of these queues is useful in devising power efficient packet scheduling. We also consider some other extenesions of the basic type of queues considered here, notably queues with delayed scheduling; a control policy where requests are not serviced until the buffer exceeds a certain size. Index Terms Discrete Time Bulk Queues, Monotone Scheduling, Steady State Distribution, Generating Function